O(lgN) Line Clipping Algorithm in E2
نویسنده
چکیده
A new O N (lg ) line clipping algorithm in E against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.
منابع مشابه
Line clipping in E2 with O(1) processing complexity
A new algorithm for line clipping by convex polygon with O( ) 1 processing complexity is presented. It is based on dual space representation and space subdivision technique. The suggested algorithm also demonstrates that pre-processing can be used in order to speed up solution of some problems in computer graphics applications significantly. Theoretical considerations and experimental results a...
متن کاملA Fast Algorithm for Line Clipping by Convex Polyhedron in E3
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O N ( ) . The suggested algorithm has O N ( ) complexity in the worst case and expected O N ( ) complexity. The speed up is achieved because of "known order" of triangle...
متن کاملSimplified High-Speed High-Distance List Decoding for Alternant Codes
This paper presents a simplified list-decoding algorithm to correct any number w of errors in any alternant code of any length n with any designed distance t+1 over any finite field Fq. The algorithm is efficient for w close to, and in many cases slightly beyond, the Fq Johnson bound J ′ = n′− √ n′(n′ − t− 1) where n′ = n(q−1)/q, assuming t+1 ≤ n′. In the typical case that qn/t ∈ (lgn) and that...
متن کاملOptimal streaming and tracking distinct elements with high probability
The distinct elements problem is one of the fundamental problems in streaming algorithms — given a stream of integers in the range {1, . . . , n}, we wish to provide a (1 + ε) approximation to the number of distinct elements in the input. After a long line of research optimal solution for this problem with constant probability of success, using O( 1 ε2 +lgn) bits of space, was given by Kane, Ne...
متن کاملBresenham's Line Generation Algorithm with Built-in Clipping
One of the most important operations in many graphical systems is the generation of a line segment. This process consists of two stages: clipping and drawing. These two stages are separated in current graphical applications. In this paper a new approach to line generation is proposed, which unifies these stages. The proposed algorithm is based on Bresenham’s line generation algorithm to include...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 18 شماره
صفحات -
تاریخ انتشار 1994